Asymptotics for Rank Partition Functions
نویسنده
چکیده
In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.
منابع مشابه
Andrews’ 2-marked Durfee Symbols and Weak Maass Forms
The modularity of the partition generating function has many important consequences, for example asymptotics and congruences for p(n). In a series of papers the author and Ono connected the rank, a partition statistic introduced by Dyson, to weak Maass forms, a new class of functions which are related to modular forms. Here we place the 2-marked Durfee symbols introduced by Andrews [1] into the...
متن کاملAsymptotics for Rank and Crank Moments
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to two of the authors that re ned a conjecture of Garvan. Garvan's original conjecture states that the moments of the crank function are always larger than the mome...
متن کاملOn the Explicit Construction of Higher Deformations of Partition Statistics
The modularity of the partition generating function has many important consequences, for example asymptotics and congruences for p(n). In a series of papers the author and Ono [12, 13] connected the rank, a partition statistic introduced by Dyson, to weak Maass forms, a new class of functions which are related to modular forms and which were first considered in [11]. Here we do a further step t...
متن کاملPhase Calculations for Planar Partition Polynomials
In the study of the asymptotic behavior of polynomials from partition theory, the determination of their leading term asymptotics inside the unit disk depends on a sequence of sets derived from comparing certain complexvalued functions constructed from polylogarithms, functions defined as
متن کاملDyson’s Crank Distribution Conjecture
Bringmann and Dousse recently established a conjecture of Dyson dealing with the limiting asymptotics of the Andrews-Garvan crank statistic for integer partitions. A direct “sieving” technique is used to establish this conjecture and establish the range of validity. Unlike the approach of Bringmann and Dousse, the technique readily yields the analogous result for Dyson’s partition rank and all ...
متن کامل